Home > Search Results: keywords:"push-relabel algoritmus"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Optimalization of flows in the network using the linear programming
 Doubrava, Jiří ; Kalčevová, Jana (advisor) ; Flusserová, Lenka (referee)
This thesis deals with optimization of flows in a network with focus on solutions based on linear programming. The theoretical part is divided into three main sections: maximal flow, minimal flow and maximal flow with minimal costs. The first part focuses on theoretical basics of maximal flow problem and mainly on these algorithms: Ford-Fulkerson, Dinic/Edmonds-Karp, Three Indians algorithm and Goldberg push-relabel algorithm. These are explained on examples. The other chapters explain the minimal flow and the maximal flow with minimal costs problems with simple algorithms for their solutions, again explained on some examples. The practical part includes software solution of maximal flow problem in application MaxTok, which can be found on attached CD.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English